Data Anonymity in the FOO Voting Scheme
نویسندگان
چکیده
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a vote, can be attributed to a user, in this case a voter. We validate the formal treatment of data anonymity by analyzing a well-known electronic voting protocol.
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملExistential Assertions for Voting Protocols
In [22], we extend the Dolev-Yao model with assertions. We build on that work and add existential abstraction to the language, which allows us to translate common constructs used in voting protocols into proof properties. We also give an equivalencebased definition of anonymity in this model, and prove anonymity for the FOO voting protocol.
متن کاملPractical Approach to Anonymity in Large Scale Electronic Voting Schemes
Anonymity of ballots in electronic voting schemes usually relies on the existence of some kind of anonymous channel between voters and ballot collecting authorities. Currently, there exist solutions based on the mix concept, which allow for anonymous e-mail communications. However, integration of such solutions into the implementation of a voting scheme has some problems. In this paper we propo...
متن کاملA Secure and Anonymous Electronic Voting Scheme Based on Key Exchange Protocol
Voter anonymity and voting correctness are important issues for electronic voting mechanisms. Compared electronic voting with traditional 1elections, an electronic voter is able to cast his/her ballot through the Internet in any place and at any time if he/she can access the network. Therefore, convenience and mobility make electronic voting become more and more popular and electronic voting ca...
متن کاملCoercion-Resistant Remote Voting using Decryption Mixes
The recently proposed Prêt à Voter election scheme uses decryption mixes to achieve anonymity of votes and verifiability of an election while requiring minimal trust in the component of the election system that performs these mixes. However, this scheme still requires trust in several human and machine components; these requirements make the scheme impractical for use in remote voting. To adapt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 168 شماره
صفحات -
تاریخ انتشار 2007